Local Search Neighbourhoods to Deal with a Novel Nurse Rostering Model

نویسندگان

  • Burak Bilgin
  • Patrick De Causmaecker
  • Greet Vanden Berghe
چکیده

A novel nurse rostering model is developed to represent real world problem instances more accurately. The proposed model is generic in a way that different problem instances can be successfully represented. Novel local search neighbourhoods are developed to take advantage of the problem properties represented by the model. These neighbourhoods are utilised within a variable neighbourhood search algorithm. The performance of the solution method is evaluated empirically on real world data. Experimental results are processed using statistical methods. An adaptive version of the solution method that uses problem instance properties to select the neighbourhood set is also proposed and experimented with. The proposed model is prone to further extensions to cover personnel planning problems in different sectors and countries. Associated new solution methods can be studied to handle these extensions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An advanced model and novel meta-heuristic solution methods to personnel scheduling in healthcare

Constructing timetables of work for personnel in healthcare institutions is known to be a highly constrained and difficult problem to solve. In this thesis, we introduce a model for the practical rostering problem in Belgian hospitals. It is general enough to cope with the large set of constraints and to meet varying objectives encountered in practice. We set up a solution framework that consis...

متن کامل

Novel Metaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals

Constructing timetables of work for personnel in healthcare institutions is a highly constrained and difficult problem to solve. In this chapter, we will present an overview of our development of the algorithms that underpin a commercial nurse rostering decision support system that is in use in over 40 hospitals in Belgium. As such, we are particularly concerned with the real world regulations ...

متن کامل

A Time Predefined Variable Depth Search for Nurse Rostering

A variety of neighbourhood operators have been used in local search and metaheuristic approaches to solving nurse rostering problems. We test and analyse the efficiency of these neighbourhoods on benchmark problems taken from real world scenarios. A variable depth search is then developed based on the results of this investigation. The algorithm heuristically chains together moves and swaps whi...

متن کامل

Nurse rostering using fuzzy logic: A case study

In this paper, we used the fuzzy set theory for modeling flexible constraints and uncertain data in nurse scheduling problems and proposed a fuzzy linear model for nurse rostering problems. The developed model can produce rosters that satisfy hospital objectives, ward requirements and staff preferences by satisfying their requests as much as possible. Fuzzy sets are used for modeling demands of...

متن کامل

A Hybrid Approach for Solving Real-World Nurse Rostering Problems

Nurse rostering is the process of creating a plan for nurse working hours over a given time horizon. This problem, most variants of which are NP-hard, has been studied extensively for many years. Still, practical nurse rostering is mostly done manually, often by highly qualified health care personnel. This underlines the need to address the challenges of realistic, applied nurse rostering, and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008